Shortest Paths between two Points in Space for Self Managed Digital Systems
نویسندگان
چکیده
Donald Hearn and M. Pauline Baker. Computer Graphics C version. Dorling Kindersley (India) Pvt. Ltd. , Licensees of Pearson Education in South Asia, 2008. Edgar A. Kraut. Fundamentals of Mathematical Physics. Dover Publications, 2007. V. Rajaraman and T. Radhakrishnan. An Introduction to Digital Computer Design. Prentice-Hall of India Private Limited New Delhi, fourth edition, June 1998. James A. Storer and John H. Reif. Shortest paths in the plane with polygon obstacles. Journal of the Association for Computing Machinery, 41, No. 5:982–1012, september 1994.
منابع مشابه
Generalized Unfoldings for Shortest Paths in Euclidean 3-Space
The problem of determining shortest paths in the presence of polyhedral obstacles between two points in Euclidean 3-space stems from the general problem of obtaining optimal coliision free paths in robot systems. For the special case when paths are constrained to the surfaces of 3-dimensional objects, simple planar unfoldings are used to obtain the shortest path. For the general case wben paths...
متن کاملQuerying Two Boundary Points for Shortest Paths in a Polygonal Domain
We consider a variant of two-point Euclidean shortest path query problem: given a polygonal domain, build a data structure for two-point shortest path query, provided that query points always lie on the boundary of the domain. As a main result, we show that a logarithmic-time query for shortest paths between boundary points can be performed using Õ(n) preprocessing time and Õ(n) space where n i...
متن کاملA survey of geodesic paths on 3D surfaces
Finding shortest paths and shortest distances between points on a surface S in three-dimensional space is a well-studied problem in differential geometry and computational geometry. The shortest path between two points on S is denoted a geodesic path on the surface and the shortest distance between two points on S is denoted a geodesic distance. In this survey, we consider the case where a disc...
متن کاملFuzzy Distance Transform: Theory, Algorithms, and Applications
This paper describes the theory and algorithms of distance transform for fuzzy subsets, called fuzzy distance transform (FDT). The notion of fuzzy distance is formulated by first defining the length of a path on a fuzzy subset and then finding the infimum of the lengths of all paths between two points. The length of a path π in a fuzzy subset of the n-dimensional continuous space n is defined a...
متن کاملSelf-Approaching Paths in Simple Polygons
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does not increase, that is, for all points a, b, and c that appear in that order along the curve, |ac| ≥ |bc|. We analyze the properties, and present a characteriza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014